Reconstruction of a tree from certain maximal proper subtrees
نویسندگان
چکیده
منابع مشابه
Reconstruction of certain phylogenetic networks from their tree-average distances.
Trees are commonly utilized to describe the evolutionary history of a collection of biological species, in which case the trees are called phylogenetic trees. Often these are reconstructed from data by making use of distances between extant species corresponding to the leaves of the tree. Because of increased recognition of the possibility of hybridization events, more attention is being given ...
متن کاملEnumerating All Maximal Frequent Subtrees
Given a collection of leaf-labeled trees on a common leafset and a fraction f in (1/2,1], a frequent subtree (FST) is a subtree isomorphically included in at least fraction f of the input trees. The well-known maximum agreement subtree (MAST) problem identifies FST with f = 1 and having the largest number of leaves. Apart from its intrinsic interest from the algorithmic perspective, MAST has pr...
متن کاملEfficient Data Mining for Maximal Frequent Subtrees
A new type of tree mining is defined in this paper, which uncovers maximal frequent induced subtrees from a database of unordered labeled trees. A novel algorithm, PathJoin, is proposed. The algorithm uses a compact data structure, FST-Forest, which compresses the trees and still keeps the original tree structure. PathJoin generates candidate subtrees by joining the frequent paths in FST-Forest...
متن کاملMining Maximal Frequent Subtrees based on Fusion Compression and FP-tree
It is commonly accepted that mining frequent subtrees play pivotal roles in areas like Web log analysis, XML document analysis, semi-structured data analysis, as well as biometric information analysis, chemical compound structure analysis, etc. An improved algorithm, i.e. MFPTM algorithm, which based on fusion compression and FP-tree principle, was proposed in this paper to determine a better w...
متن کاملPacking and covering a tree by subtrees
(P0) Max Z {c(V)x(T): TEo~} subject to ~ ' { x ( T ) : T)v} _-< 1 (vEV), x(r)~{0, 1} (rc~), where c(T) is a weight function on -~. It is known that this problem can be solved by a polynomial-time algorithm as the intersection graph of o~ is triangulated [3] and the maximum weighted stable set problem on a triangulated graph can be solved efficiently [2], see also [4]. In this paper we consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1974
ISSN: 0528-2195
DOI: 10.21136/cpm.1974.108216